Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects

A formal support to business and architectural design for service-oriented systems

Architectural Design Rewriting (ADR) is an approach for the design of software architectures developed within Sensoria by reconciling graph transformation and process calculi techniques. The key feature that makes ADR a suitable and expressive framework is the algebraic handling of structured graphs, which improves the support for specification, analysis and verification of service-oriented architectures and applications. We show how ADR is used as a formal ground for high-level modelling languages and approaches developed within Sensoria

A diffuse domotic control powered by a networked intelligence

We describe a diffuse control system for household appliances rooted in an Internet of Thing network empowered by a cognitive system. The key idea is that these appliances constitute an ecosystem populated by a plenty of devices with common features, yet called to satisfy in an almost repetitive way needs that may be very diversified, depending on the user preferences. This calls for a network putting them in connection and a cognitive system that is capable to interpret the user requests and translate them into instructions to be transmitted to the appliances. This in turn requires a proper architecture and efficient protocols for connecting the appliances to the network, as well as robust algorithms that concretely challenge cognitive and connectionist theories to produce the instructions ruling the appliances. We discuss both aspects from a design perspective and exhibit a mockup where connections and algorithms are implemented

Random Graph-Homomorphisms and Logarithmic Degree

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is `sub-logarithmic', then the range of such a homomorphism is super-constant. Furthermore, some examples are provided, suggesting that perhaps for graphs with super-logarithmic degree, the range of a typical homomorphism is bounded. In particular, a sharp transition is shown for a specific family of graphs C_{n,k} (which is the tensor product of the n-cycle and a complete graph, with self-loops, of size k). That is, given any function psi(n) tending to infinity, the range of a typical homomorphism of C_{n,k} is super-constant for k = 2 log(n) - psi(n), and is 3 for k = 2 log(n) + psi(n)

Choreography Rehearsal ⋆

Abstract. We propose a methodology for statically predicting the possible interaction patterns of services within a given choreography. We focus on choreographies exploiting the event notification paradigm to manage service interactions. Control Flow Analysis techniques statically approximate which events can be delivered to match the choreography constraints and how the multicast groups can be optimised to handle event notification within the service choreography.

An Algebra of Hierarchical Graphs

We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects

Stochastic Quantization of the Chern-Simons Theory

We discuss Stochastic Quantization of $d$=3 dimensional non-Abelian Chern-Simons theory. We demonstrate that the introduction of an appropriate regulator in the Langevin equation yields a well-defined equilibrium limit, thus leading to the correct propagator. We also analyze the connection between $d$=3 Chern-Simons and $d$=4 Topological Yang-Mills theories showing the equivalence between the corresponding regularized partition functions. We study the construction of topological invariants and the introduction of a non-trivial kernel as an alternative regularization.Comment: 30 page

Towards an embedding of Graph Transformation in Intuitionistic Linear Logic

Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic, leading to a Curry-Howard style isomorphism between graphs and transformations on one hand, formulas and proof terms on the other. With linear implication representing rules and reachability of graphs, and the tensor modelling parallel composition of graphs and transformations, we obtain a language able to encode graph transformation systems and their computations as well as reason about their properties

A new, very massive modular Liquid Argon Imaging Chamber to detect low energy off-axis neutrinos from the CNGS beam. (Project MODULAr)

The paper is considering an opportunity for the CERN/GranSasso (CNGS) neutrino complex, concurrent time-wise with T2K and NOvA, to search for theta_13 oscillations and CP violation. Compared with large water Cherenkov (T2K) and fine grained scintillators (NOvA), the LAr-TPC offers a higher detection efficiency and a lower backgrounds, since virtually all channels may be unambiguously recognized. The present proposal, called MODULAr, describes a 20 kt fiducial volume LAr-TPC, following very closely the technology developed for the ICARUS-T60o, and is focused on the following activities, for which we seek an extended international collaboration: (1) the neutrino beam from the CERN 400 GeV proton beam and an optimised horn focussing, eventually with an increased intensity in the framework of the LHC accelerator improvement program; (2) A new experimental area LNGS-B, of at least 50000 m3 at 10 km off-axis from the main Laboratory, eventually upgradable to larger sizes. A location is under consideration at about 1.2 km equivalent water depth; (3) A new LAr Imaging detector of at least 20 kt fiducial mass. Such an increase in the volume over the current ICARUS T600 needs to be carefully considered. It is concluded that a very large mass is best realised with a set of many identical, independent units, each of 5 kt, "cloning" the technology of the T600. Further phases may foresee extensions of MODULAr to meet future physics goals. The experiment might reasonably be operational in about 4/5 years, provided a new hall is excavated in the vicinity of the Gran Sasso Laboratory and adequate funding and participation are made available.Comment: Correspondig Author: C. Rubbia (E-mail: [email protected]), 33 pages, 11 figure